The balanced connected subgraph problem
نویسندگان
چکیده
منابع مشابه
The Maximum Weight Connected Subgraph Problem
The Maximum (Node-) Weight Connected Subgraph Problem (MWCS) searches for a connected subgraph with maximum total weight in a node-weighted (di)graph. In this work we introduce a new integer linear programming formulation built on node variables only, which uses new constraints based on node-separators. We theoretically compare its strength to previously used MIP models in the literature and st...
متن کاملHardness of approximation of the Balanced Complete Bipartite Subgraph problem
We prove that the Maximum Balanced Complete Bipartite Subgraph (BCBS) problem is hard to approximate within a factor of 2 n) δ for some δ > 0 under the plausible assumption that 3-SAT ∈ DTIME ( 2 3/4+ ) for some > 0. We also show that it is NP -hard to approximate the BCBS problem within a constant factor under the assumption that it is NP -hard to approximate the maximum clique problem within ...
متن کاملSolving the Maximum-Weight Connected Subgraph Problem to Optimality
1 Department of Computer Science and Center for Computational Molecular Biology, Brown University, Providence, RI, 02906, USA 2 Life Sciences group, Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam, the Netherlands 3 Centre for Integrative Bioinformatics VU (IBIVU), VU University Amsterdam, De Boelelaan 1081A, 1081 HV Amsterdam, the Netherlands [email protected], gu...
متن کاملOn the minimum-cost λ-edge-connected k-subgraph problem
In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost λ -edge-connected k-subgraph problem, or the (k,λ )-subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if λ = 1), λ -edgeconnected spanning subgraph problem (if k = |V |) and k-clique problem (if λ = k−1 and...
متن کاملThe Minimum Cost Connected Subgraph Problem in Medical Image Analysis
Several important tasks in medical image analysis can be stated in the form of an optimization problem whose feasible solutions are connected subgraphs. Examples include the reconstruction of neural or vascular structures under connectedness constraints. We discuss the minimum cost connected subgraph (MCCS) problem and its approximations from the perspective of medical applications. We propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: 0166-218X
DOI: 10.1016/j.dam.2020.12.030